Online Packing of Equilateral Triangles
نویسندگان
چکیده
We investigate the online triangle packing problem in which a sequence of equilateral triangles with different sizes appear in an online, sequential manner. The goal is to place these triangles into a minimum number of squares of unit size. We provide upper and lower bounds for the competitive ratio of online algorithms. In particular, we introduce an algorithm which achieves a competitive ratio of at most 2.474. On the other hand, we show that no online algorithm can have a competitive ratio better than 1.509.
منابع مشابه
Packing and Covering a Unit Equilateral Triangle with Equilateral Triangles
Packing and covering are elementary but very important in combinatorial geometry , they have great practical and theoretical significance. In this paper, we discuss a problem on packing and covering a unit equilateral triangle with smaller triangles which is originated from one of Erd˝ os' favorite problems.
متن کاملA novel chiral phase of achiral hard triangles and an entropy-driven demixing of enantiomers.
We investigate the phase behavior of a system of hard equilateral and right-angled triangles in two dimensions using Monte Carlo simulations. Hard equilateral triangles undergo a continuous isotropic-triatic liquid crystal phase transition at packing fraction ϕ = 0.7. Similarly, hard right-angled isosceles triangles exhibit a first-order phase transition from an isotropic fluid phase to a rhomb...
متن کاملNP-Hard Triangle Packing Problems
In computational geometry, packing problems ask whether a set of rigid pieces can be placed inside a target region such that no two pieces overlap. The triangle packing problem is a packing problem that involves triangular pieces, and it is crucial for algorithm design in many areas, including origami design, cutting industries, and warehousing. Previous works in packing algorithms have conject...
متن کاملTranslative Packing of Unit Squares into Equilateral Triangles
Every collection of n (arbitrary-oriented) unit squares can be packed translatively into any equilateral triangle of side length 2.3755 ̈ ? n. Let the coordinate system in the Euclidean plane be given. For 0 ≤ αi ă π{2, denote by Spαiq a square in the plane with sides of unit length and with an angle between the x-axis and a side of Spαiq equal to αi. Furthermore, let T psq be an equilateral tr...
متن کاملDense Packings of Equal Disks in an Equilateral Triangle: from 22 to 34 and Beyond
Previously published packings of equal disks in an equilateral triangle have dealt with up to 21 disks. We use a new discrete-event simulation algorithm to produce packings for up to 34 disks. For each n in the range 22 ≤ n ≤ 34 we present what we believe to be the densest possible packing of n equal disks in an equilateral triangle. For these n we also list the second, often the third and some...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015